Scheduling complete intrees on two uniform processors with communication delays
نویسندگان
چکیده
منابع مشابه
Scheduling Complete Intrees on Two Uniform Processors with Communication Delays
In this paper we present an optimal algorithm for scheduling complete k-ary tree on two uniform processors of di erent speeds in order to minimize schedule length. We consider the basic case of unit standard execution times and unit communication times.
متن کاملScheduling UET Trees with Communication Delays on two Processors
In this paper, we present a new linear time algorithm for scheduling uect (Unit Execution and Communication Time) trees on two identical processors: CBoS (clusters based on subtrees). The chosen criterion is the makespan. The used strategy is based on clustering of tasks. We show that this algorithm builds optimal schedules. Some extensions are discussed for non uet tasks. Nous pr esentons un n...
متن کاملScheduling Tasks with Communication Delays on Parallel Processors
Let Jn={v1,...,vn} be a set of n jobs to be executed and E a set of precedence constraints on Jn. Assume that we have available a set Mk={m1,...,mk} of k identical machines that are to execute the jobs in Jn such that the time needed by any machine to execute each job in Jn is one unit. Our main result in this paper is to give an O(n log2(n)) algorithm to find an optimal scheduling with communi...
متن کاملSemi-online scheduling on two uniform processors
In this paper we consider the problem of semi on-line scheduling on two uniform processors, in the case where the total sum of the tasks is known in advance. Tasks arrive one at a time and have to be assigned to one of the two processors before the next one arrives. The assignment cannot be changed later. The objective is the minimization of the makespan. We derive lower bounds and algorithms, ...
متن کاملPreemptive on-line scheduling for two uniform processors
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the processors has speed 1 and the other has speed s¿1. The objective is to minimize the makespan. A best possible algorithm with competitive ratio of (1+s)=(1+s+s) is proposed for this problem. c © 1998 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1996
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00062-2